Generalized vertex covering in interval graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Vertex Covering in Interval Graphs

Marathe, M.V., R. Ravi and C. Pandu Rangan, Generalized vertex covering in interval graphs. Discrete Applied Mathematics 39 (1992) 87-93. Given an integer i and an undirected graph G. the genera!ized i-verkx OFJPY pr&!z~ is to find a minimum set of vertices such that all chques in G of size i contain at least one vertex from this set. This problem is known to be NP-complete for chordal graphs w...

متن کامل

The robust vertex centdian location problem with interval vertex weights on general graphs

In this paper, the robust vertex centdian  location  problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max  regret criterion. This problem  is  investigated  with objective function contains $lambda$  and  a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...

متن کامل

Packing interval graphs with vertex-disjoint triangles

We show that there exists a polynomial algorithm to pack interval graphs with vertex-disjoint triangles.

متن کامل

Constructing vertex decomposable graphs

‎Recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎In this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎Then we use this construction to generalize the result due to Cook and Nagel‎.

متن کامل

Further Results on Vertex Covering of Powers of Complete Graphs

A snake in a graph G is defined to be a closed path in G without proper chords. Let Kd n be the product of d copies of the complete graph Kn. Wojciechowski [13] proved that for any d ≥ 2 the hypercube Kd 2 can be vertex covered with at most 16 disjoint snakes. Alsardary [6] proved that for any odd integer n ≥ 3,d ≥ 2 the graph Kd n can be vertex covered with 2n 3 snakes. We show that for any ev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1992

ISSN: 0166-218X

DOI: 10.1016/0166-218x(92)90116-r